An Efficient Approach to Correspondences between Multiple Non-Rigid Parts

نویسندگان

  • Gary K. L. Tam
  • Ralph R. Martin
  • Paul L. Rosin
  • Yu-Kun Lai
چکیده

Identifying multiple deformable parts on meshes and establishing dense correspondences between them are tasks of fundamental importance to computer graphics, with applications to e.g. geometric edit propagation and texture transfer. Much research has considered establishing correspondences between non-rigid surfaces, but little work can both identify similar multiple deformable parts and handle partial shape correspondences. This paper addresses two related problems, treating them as a whole: (i) identifying similar deformable parts on a mesh, related by a non-rigid transformation to a given query part, and (ii) establishing dense point correspondences automatically between such parts. We show that simple and efficient techniques can be developed if we make the assumption that these parts locally undergo isometric deformation. Our insight is that similar deformable parts are suggested by large clusters of point correspondences that are isometrically consistent. Once such parts are identified, dense point correspondences can be obtained by an iterative propagation process. Our techniques are applicable to models with arbitrary topology. Various examples demonstrate the effectiveness of our techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Rigid Registration Under Isometric Deformations

We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimization problem and solves it by alternating between correspondence and deformation optimization. Assuming approximately isometric deformations, robust correspondences are generated using a pruning mechanism based on geod...

متن کامل

Two-level method for 3D non-rigid registration - with an application to statistical atlases construction

We propose a two-level method for 3D non-rigid registration and apply the method to the problem of building statistical atlases of 3D anatomical structures. 3D registration is an important problem in computer vision and a challenge topic in medical image field due to the geometrical complexity of anatomical shapes and size of medical image data. In this work we adopt a two-level strategy to dea...

متن کامل

Surface Registration by Matching Oriented Points

For registration of 3-D free-form surfaces we have developed a representation which requires no knowledge of the transformation between views. The representation comprises descriptive images associated with oriented points on the surface of an object. Constructed using single point bases, these images are data level shape descriptions that are used for efficient matching of oriented points. Cor...

متن کامل

An Efficient Strain Based Cylindrical Shell Finite Element

The need for compatibility between degrees of freedom of various elements is a major problem encountered in practice during the modeling of complex structures; the problem is generally solved by an additional rotational degree of freedom [1-3]. This present paper investigates possible improvements to the performances of strain based cylindrical shell finite element [4] by introducing an additio...

متن کامل

Feature Densities Are Required for Computing Feature Correspondences

The feature correspondence problem is a classic hurdle in visual object-recognition concerned with determining the correct mapping between the features measured from the image and the features expected by the model. In this paper we show that determining good correspondences requires information about the joint probability density over the image features. We propose "likelihood based correspond...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2014